Learning Horn Expressions with LogAn - HAppears in the Proceedings of ICML 2000

نویسنده

  • Roni Khardon
چکیده

The paper introduces LogAn-H | a system for learning rst-order function-free Horn expressions from interpretations. The system is based on an interactive algorithm (that asks questions) that was proved correct in previous work. The current paper shows how the algorithm can be implemented in a practical system by reducing some ineeciencies. Moreover, the paper introduces a new algorithm based on it that avoids interaction and learns from examples only. We describe qualitative and quantitative experiments in several domains. The experiments demonstrate that the system can deal with varied problems , large amounts of data and large hypotheses , and that it achieves good classii-cation accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Horn Expressions with LogAn-H

The paper introduces LOGAN-H —a system for learning first-order function-free Horn expressions from interpretations. The system is based on an algorithm that learns by asking questions and that was proved correct in previous work. The current paper shows how the algorithm can be implemented in a practical system, and introduces a new algorithm based on it that avoids interaction and learns from...

متن کامل

A New Algorithm for Learning Range Restricted Horn Expressions

A learning algorithm for the class of range restricted Horn expressions is presented and proved correct. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some pre-fixed and unknown expression by making questions to membership and equivalence oracles. This class has been shown to be learnable in previous work. The main contribution of th...

متن کامل

Learning Inequated Range Restricted Horn Expressions

A learning algorithm for the class of inequated range restricted Horn expressions is presented and proved correct. The main property of this class is that all the terms in the conclusion of a clause appear in the antecedent of the clause, possibly as subterms of more complex terms. And every clause includes in its antecedent all inequalities possible between all terms appearing in it. The algor...

متن کامل

Learning First-Order Acyclic Horn Programs from Entailment

In this paper, we consider learning rst-order Horn programs from entailment. In particular, we show that any subclass of rst-order acyclic Horn programs with constant arity is exactly learnable from equivalence and entailment membership queries provided it allows a polynomial-time subsumption procedure and satisses some closure conditions. One consequence of this is that rst-order acyclic deter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000